Polycyclic Groups: a New Platform for Cryptology?
نویسنده
چکیده
We propose a new cryptosystem based on polycyclic groups. The cryptosystem is based on the fact that the word problem can be solved effectively in polycyclic groups, while the known solutions to the conjugacy problem are far less efficient.
منابع مشابه
Length-based attacks in polycyclic groups
The Anshel-Anshel-Goldfeld (AAG) key-exchange protocol was implemented and studied with the braid groups as its underlying platform. The length-based attack, introduced by Hughes and Tannenbaum, has been used to cryptanalyze the AAG protocol in this setting. Eick and Kahrobaei suggest to use the polycyclic groups as a possible platform for the AAG protocol. In this paper, we apply several known...
متن کاملOn the Dimension of Matrix Representations of Finitely Generated Torsion Free Nilpotent Groups
It is well known that any polycyclic group, and hence any finitely generated nilpotent group, can be embedded into GLn(Z) for an appropriate n ∈ N; that is, each element in the group has a unique matrix representation. An algorithm to determine this embedding was presented in [6]. In this paper, we determine the complexity of the crux of the algorithm and the dimension of the matrices produced ...
متن کاملThe Status of Polycyclic Group-Based Cryptography: A Survey and Open Problems
Polycyclic groups are natural generalizations of cyclic groups but with more complicated algorithmic properties. They are finitely presented and the word, conjugacy, and isomorphism decision problems are all solvable in these groups. Moreover, the non-virtually nilpotent ones exhibit an exponential growth rate. These properties make them suitable for use in group-based cryptography, which was p...
متن کاملSecurity Analysis and Design of Proxy Signature Schemes over Braid Groups
The braid groups have attracted much attention as a new platform of constructing cryptosystems. This paper firstly analyzes the security vulnerabilities of existing proxy signature schemes over braid groups and presents feasible attacks. Then a new proxy signature scheme is proposed based on the difficulty of the conjugacy search problem and the multiple conjugacy search problem. Security analy...
متن کاملCryptanalysing the critical group: efficiently solving Biggs's discrete logarithm problem
Biggs has recently proposed the critical group of a certain class of finite graphs as a platform group for cryptosystems relying on the difficulty of the discrete log problem. The paper uses techniques from the theory of Picard groups on finite graphs to show that the discrete log problem can be efficiently solved in Biggs’s groups. Thus this class of groups is not suitable as a platform for di...
متن کامل